dual graph
英 [ˈdjuːəl ɡræf]
美 [ˈduːəl ɡræf]
网络 对偶图; 图的对偶
双语例句
- In this paper, we define quasi I dual autoisomphism and quasi dual autoisomphism of k ary de Bruijn Good graph G n, And use isomorphic property.
利用格上半群的对偶同构这一工具，研究格上半群的一些性质，并给出格上半群构成格群的一个充分且必要条件。 - This paper presents a definition of imitative dual graph of outplane graphs, and proves the structural theorem on outplane graphs by using the nature of imitative dual graph of outplane graphs.
给出了外平面图的拟对偶图的定义，并利用拟对偶图的性质证明了外平面图的结构定理。 - Dual Bandwidth of the r-corona Graph of Cycle C_n
圈Cn的r-冠图的对偶带宽 - In Chapter 4, we exhibit how the arithmetical conditions of the dual graph of a finite group influence its structures.
第四章主要研究有限群的对偶图的算术条件对群结构的影响。 - In this paper the authors define a dual graph of a finite group and classify the finite non-abelian groups with dual graphs without triangles.
定义了有限群的对偶图，给出了对偶图不含三角形的非交换有限群的分类。 - Characteristic Graph ( Tree) of Dual Binary Chromatic Subgraph of Maximal Planar Graph to be Colored with 4 Colors
极大平面图对偶二色子图结构特性树 - The 4-regular plane graph and Hamilton cycle of dual graph
四正则平面图与其对偶图的哈密顿圈 - The sufficient and necessary conditions for a planar graph is that this graph must be a dual graph.
一个图是平面图的充分必要条件是这个图存在对偶图。 - The Necessary and Sufficient Condition of Self-dual Graph
自对偶图的充要条件 - To use this method, the second eigenvector of the discrete Laplacian matrix of the dual graph of a mesh is computed and the bisection is obtained from components of this eigenvector.
为使用这种方法，计算了网格伴随图的离散Laplacian矩阵的第二特征矢，然后从该特征矢的分量引入网格的对剖分。 - Based on the dual relation between flow graph and potential graph, flow graph represent the trusses and potential graph represent the mechanisms, obtained the duality relation between trusses and mechanisms.
基于流图和势图的对偶关系以及基尔霍夫定律，用流图表示桁架，势图表示机构，建立了桁架和机构的对偶关系。 - The Proof of Some Properties of The Self-Dual Graph
试论自对偶图的一些性质 - Dual graph algorithm for the volume of the city road network
城市道路网容量的对偶图算法 - In case of graph G representing a conflict relation, the following dual problem is proposed: to embed G into a host graph H such that the minimum stretch of the edges of G is maximized.
当图G表示一种冲突关系时，便提出如下的对偶问题：将图G嵌入于主图H，使得边的最小跨度达到最大。 - The dual bandwidth of a graph G, denoted by ( G), is the maximum value of the minimum labelling variance of any two adjacent vertices in G.
图G的对偶带宽是指图G中相邻两点最小标号差的最大值。 - Moreover, the corresponding problem of the dual polar graph A δ of ( 2v+ δ)-dimensional pseudo-symplectic space over Fq are also solved.
进一步，Fq上2v＋δ维伪辛空间的对偶极图Aδ的相应问题也被解决。 - A new method for understanding the construction of dual links has been developed on the basis of medial graph in graph theory and tangle in knot theory.
基于图论中反转中间图的方法和纽结理论中的缠绕理论，我们提出了构建对偶链环的新方法。